Efficient and Effective Directed Minimum Spanning Tree Queries

Computing directed Minimum Spanning Tree (DMST) is a fundamental problem in graph theory. It applied wide spectrum of fields from computer network and communication protocol design to revenue maximization social networks syntactic parsing Natural Language Processing. State-of-the-art solutions are online algorithms that compute DMST for given root. For multi-query requirements, the algorithm inefficient. To overcome drawbacks, this paper, we propose an indexed approach reuses computation result facilitate single batch queries. We store all potential edges hierarchical tree O(n) space complexity. Furthermore, answer query any root time Experimental results demonstrate our can achieve speedup 2–3 orders magnitude processing compared state-of-the-art while consuming index size.